Discrete warehouse problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Warehouse-Retailer Network Design Problem

In this paper, we study the distribution network design problem integrating transportation and infinite horizon multiechelon inventory cost function. We consider the trade-off between inventory cost, direct shipment cost, and facility location cost in such a system. The problem is to determine how many warehouses to set up, where to locate them, how to serve the retailers using these warehouses...

متن کامل

Efficient formulations for dynamic warehouse location under discrete transportation costs

A Mixed-integer Linear Programming model is proposed to determine the optimal number, location and capacity of the warehouses required to support a long-term forecast for a business with seasonal demand. Discrete transportation costs, dynamic warehouse contracting, and the handling of safety stock are the three main distinctive features of the problem. Four alternatives for addressing discrete ...

متن کامل

Positive solutions for discrete fractional initial value problem

‎‎In this paper‎, ‎the existence and uniqueness of positive solutions for a class of nonlinear initial value problem for a finite fractional difference equation obtained by constructing the upper and lower control functions of nonlinear term without any monotone requirement‎ .‎The solutions of fractional difference equation are the size of tumor in model tumor growth described by the Gompertz f...

متن کامل

Optimal Capacities in Discrete Facility Location Design Problem

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

متن کامل

Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1995

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)00192-l